11![Mixing Times for Random Walks on Geometric Random Graphs Stephen Boyd Arpita Ghosh Mixing Times for Random Walks on Geometric Random Graphs Stephen Boyd Arpita Ghosh](https://www.pdfsearch.io/img/d305e611c7cb39b4869f83ce58c4eb82.jpg) | Add to Reading ListSource URL: www.siam.orgLanguage: English - Date: 2005-07-06 08:19:10
|
---|
12![CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub](https://www.pdfsearch.io/img/1044bf1bd10728b866adff06d334d155.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2010-07-19 10:46:18
|
---|
13![ANALCO13 – Accepted Papers Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions Clemens Heuberger, Daniel Krenn and Stephan Wagner Perpetuities in fair leader election algorithms Ra ANALCO13 – Accepted Papers Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions Clemens Heuberger, Daniel Krenn and Stephan Wagner Perpetuities in fair leader election algorithms Ra](https://www.pdfsearch.io/img/0e4e1c61cb19097221c08cb531392095.jpg) | Add to Reading ListSource URL: www.siam.orgLanguage: English - Date: 2012-10-11 09:53:53
|
---|
14![20th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms AOFA’09 June, 20th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms AOFA’09 June,](https://www.pdfsearch.io/img/66827dc995ea1db888530c8e2ac69c20.jpg) | Add to Reading ListSource URL: aofa2009.greyc.frLanguage: English - Date: 2009-06-15 08:15:19
|
---|
15![On the Hyperbolicity of Small-World and Tree-Like Random Graphs Wei Chen1 , Wenjie Fang2 , Guangda Hu3 , and Michael W. Mahoney4 1 Microsoft Research Asia On the Hyperbolicity of Small-World and Tree-Like Random Graphs Wei Chen1 , Wenjie Fang2 , Guangda Hu3 , and Michael W. Mahoney4 1 Microsoft Research Asia](https://www.pdfsearch.io/img/cf2f891a1166c654f2bf931f924b3836.jpg) | Add to Reading ListSource URL: www.cs.yale.eduLanguage: English - Date: 2013-02-22 15:51:39
|
---|
16![1 Ad hoc wireless networks with noisy links Abstract— Models of ad-hoc wireless networks are often based on the geometric disc abstraction: transmission is assumed to be 1 Ad hoc wireless networks with noisy links Abstract— Models of ad-hoc wireless networks are often based on the geometric disc abstraction: transmission is assumed to be](https://www.pdfsearch.io/img/cdfe250e6772513e699998299fbac593.jpg) | Add to Reading ListSource URL: www.paradise.caltech.eduLanguage: English - Date: 2003-09-02 03:38:02
|
---|
17![Distance functions on random geometric graphs uniform density. If we build an unweighted kNN graph based on this data and apply Isomap to recover the point configuration, we get the figure on the right. Obviously, it is Distance functions on random geometric graphs uniform density. If we build an unweighted kNN graph based on this data and apply Isomap to recover the point configuration, we get the figure on the right. Obviously, it is](https://www.pdfsearch.io/img/360ad9ae881c047c960e1d679f74d045.jpg) | Add to Reading ListSource URL: www.is.tuebingen.mpg.deLanguage: English - Date: 2012-12-21 09:36:16
|
---|
18![Graph estimation with matrix variate normal instances Shuheng Zhou The University of Michigan, Ann Arbor SAMSI-CRM Workshop on Geometric Aspects of High-dimensional Inference Research Triangle Park, North Carolina Graph estimation with matrix variate normal instances Shuheng Zhou The University of Michigan, Ann Arbor SAMSI-CRM Workshop on Geometric Aspects of High-dimensional Inference Research Triangle Park, North Carolina](https://www.pdfsearch.io/img/323570a16f4b3960246c1e6f3f7ad5c3.jpg) | Add to Reading ListSource URL: www.samsi.infoLanguage: English - Date: 2014-04-03 17:33:40
|
---|
19![JSAC - CALL FOR PAPERS Stochastic Geometry and Random Graphs for Wireless Networks Stochastic geometry and the theory of random geometric graphs have emerged as essential tools in the analysis and design of wireless comm JSAC - CALL FOR PAPERS Stochastic Geometry and Random Graphs for Wireless Networks Stochastic geometry and the theory of random geometric graphs have emerged as essential tools in the analysis and design of wireless comm](https://www.pdfsearch.io/img/eb9e4a51ae233ab5f6fead273a89c55a.jpg) | Add to Reading ListSource URL: www.jsac.ucsd.eduLanguage: English - Date: 2008-01-22 11:17:40
|
---|
20![](https://www.pdfsearch.io/img/4d1ebbca8d485f35a2af38629152c88b.jpg) | Add to Reading ListSource URL: www.win.tue.nlLanguage: English - Date: 2009-05-02 09:40:58
|
---|